Successive approximation algorithm for beam-position-monitor-based LHC collimator alignment
نویسندگان
چکیده
منابع مشابه
Remote Control of Heterogeneous Sensors for 3d Lhc Collimator Alignment
Periodically the alignment of LHC collimators needs to be verified. Access for personnel is limited due to the level of radiation close to the collimators. The required measurement precision must be comparable to the other equipment in the LHC tunnel, meaning 0.15 mm in a sliding window of 200 m. Hence conventional measurements take 4 days for a team of 3 people. This presentation covers the de...
متن کاملBeam Position Monitor Development for the Usr*
Capacitive pick-ups for closed-orbit measurements are presently under development for an Ultra-low energy Storage Ring (USR) at the future Facility for Low-energy Antiproton and Ion Research (FLAIR). Low-intensity, low-energy antiprotons impose challenging demands on the sensitivity of the monitoring system. The nondestructive beam position monitors (BPMs) should be able to measure about 10 par...
متن کاملBeam Position Monitor Test Stand
The need to produce intense X-rays in the Energy Recovery Linear Accelerator requires shorter and narrower electron beams than the Cornell Electron Storage Ring can provide. Such electron beams will demand highly accurate beam position monitors (BPMs) to enable operators to control the beam. To prepare for new BPMs, a test stand has been built to conduct experiments on new algorithms and design...
متن کاملSecondary Electron Emission Beam Loss Monitor for LHC
Beam Loss Monitoring (BLM) system is a vital part of the active protection of the LHC accelerators’ elements. It should provide the number of particles lost from the primary hadron beam by measuring the radiation field induced by their interaction with matter surrounding the beam pipe. The LHC BLM system will use ionization chambers as standard detectors but in the areas where very high dose ra...
متن کاملA Successive Approximation Algorithm for Coordination Problems
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), exploits structured interaction to produce significant computational gains. Empirically, CSA exhibits very good anytime performance, but an error bound on the results has not been established. We reformulate the algorithm a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Special Topics - Accelerators and Beams
سال: 2014
ISSN: 1098-4402
DOI: 10.1103/physrevstab.17.021005